#include <bits/stdc++.h>
#define F(i, a, b) for (int i = (a); i <= (b); ++i)
#define dF(i, a, b) for (int i = (a); i >= (b); --i)

using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
const int K = 1e5, N = K + 5;

int n, a[N], ans, t[N];

int main() {
  freopen("duel.in", "r", stdin);
  freopen("duel.out", "w", stdout);
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  F(i, 1, n) cin >> a[i], ++t[a[i]];
  F(i, 1, K) ans += t[i] - min(ans, t[i]);
  cout << ans << "\n";
  return 0;
}